B2[ g] Sets and a Conjecture of Schinzel and Schmidt
نویسندگان
چکیده
A set of integers A is called a B2[g] set if every integer m has at most g representations of the form m = a+ a′, with a a′ and a, a′ ∈ A. We obtain a new lower bound for F(g, n), the largest cardinality of a B2[g] set in {1, . . . , n}. More precisely, we prove that lim infn→∞ F(g,n) √gn 2 π − εg where εg → 0 when g → ∞. We show a connection between this problem and another one discussed by Schinzel and Schmidt, which can be considered its continuous version.
منابع مشابه
Frankl's Conjecture for a subclass of semimodular lattices
In this paper, we prove Frankl's Conjecture for an upper semimodular lattice $L$ such that $|J(L)setminus A(L)| leq 3$, where $J(L)$ and $A(L)$ are the set of join-irreducible elements and the set of atoms respectively. It is known that the class of planar lattices is contained in the class of dismantlable lattices and the class of dismantlable lattices is contained in the class of lattices ha...
متن کامل-λ coloring of graphs and Conjecture Δ ^ 2
For a given graph G, the square of G, denoted by G2, is a graph with the vertex set V(G) such that two vertices are adjacent if and only if the distance of these vertices in G is at most two. A graph G is called squared if there exists some graph H such that G= H2. A function f:V(G) {0,1,2…, k} is called a coloring of G if for every pair of vertices x,yV(G) with d(x,y)=1 we have |f(x)-f(y)|2 an...
متن کاملOn Hilbert Golab-Schinzel type functional equation
Let $X$ be a vector space over a field $K$ of real or complex numbers. We will prove the superstability of the following Go{l}c{a}b-Schinzel type equation$$f(x+g(x)y)=f(x)f(y), x,yin X,$$where $f,g:Xrightarrow K$ are unknown functions (satisfying some assumptions). Then we generalize the superstability result for this equation with values in the field of complex numbers to the case of an arbitr...
متن کاملG-frames and Hilbert-Schmidt operators
In this paper we introduce and study Besselian $g$-frames. We show that the kernel of associated synthesis operator for a Besselian $g$-frame is finite dimensional. We also introduce $alpha$-dual of a $g$-frame and we get some results when we use the Hilbert-Schmidt norm for the members of a $g$-frame in a finite dimensional Hilbert space.
متن کاملOn the domination polynomials of non P4-free graphs
A graph $G$ is called $P_4$-free, if $G$ does not contain an induced subgraph $P_4$. The domination polynomial of a graph $G$ of order $n$ is the polynomial $D(G,x)=sum_{i=1}^{n} d(G,i) x^{i}$, where $d(G,i)$ is the number of dominating sets of $G$ of size $i$. Every root of $D(G,x)$ is called a domination root of $G$. In this paper we state and prove formula for the domination polynomial of no...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Combinatorics, Probability & Computing
دوره 17 شماره
صفحات -
تاریخ انتشار 2008